A practical heuristic for finding graph minors
نویسندگان
چکیده
We present a heuristic algorithm for finding a graph H as a minor of a graph G that is practical for sparse G and H with hundreds of vertices. We also explain the practical importance of finding graph minors in mapping quadratic pseudo-boolean optimization problems onto an adiabatic quantum annealer.
منابع مشابه
Degree-Based Treewidth Lower Bounds
Every lower bound for treewidth can be extended by taking the maximum of the lower bound over all subgraphs or minors. This extension is shown to be a very vital idea for improving treewidth lower bounds. In this paper, we investigate a total of nine graph parameters, providing lower bounds for treewidth. The parameters have in common that they all are the vertex-degree of some vertex in a subg...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملGraphs, branchwidth, and tangles! Oh my!
Branch decomposition-based algorithms have been used in practical settings to solve some NP-hard problems like the travelling salesman problem (TSP) and general minor containment. The notions of branch decompositions and branchwidth were introduced by Robertson and Seymour to assist in proving the Graph Minors Theorem. Given a connected graph G and a branch decomposition of G of width k where k...
متن کاملFinding Large Clique Minors is Hard
We prove that it is NP-complete, given a graph G and a parameter h, to determine whether G contains a complete graph Kh as a minor. Submitted: June 2008 Reviewed: April 2009 Revised: May 2009 Accepted: July 2009 Final: July 2009 Published: July 2008 Article type: Concise paper Communicated by: G. Liotta Research supported in part by NSF grant 0830403 and by the Office of Naval Research under gr...
متن کاملTreewidth and graph minors
We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under which a graph problem has a polynomial time algorithm (though the algorithms that come out of the theory are often not practical). We shall review a small part of this theory, and illustrate how dynamic programming can be used to solve some NP-hard problems on restricted cla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1406.2741 شماره
صفحات -
تاریخ انتشار 2014